A Logic of Relative Desire (Preliminary Report)
نویسندگان
چکیده
Although many have proposed formal characterizations of belief structures as bases for rational action, the problem of characterizing rational desires has attracted little attention. AI relies heavily on goal conditions interpreted (apparently) as absolute expressions of desirability, but these cannot express varying degrees of goal satisfaction or preferences among alternative goals. Our previous work provided a relative interpretation of goals as qualitative statements about preferability, all else equal. We extend that treatment to the comparison of arbitrary propositions, and develop a propositional logic of relative desire suitable for formalizing properties of planning and problem-solving methods.
منابع مشابه
A Critical Examination of Ibn-Sina’s Theory of the Conditional Syllogism
This paper will examine Ibn Sina’s theory of the Conditional Syllogism from a purely logical point of view, and will lay bare the principles he adopted for founding his theory, and the reason why the newly introduced part of his logic remained undeveloped and eventually was removed from the texts of logic in the later Islamic tradition. As a preliminary discussion, this paper briefly examines I...
متن کاملA Logic of Relative Desire (
Although many have proposed formal characterizations of belief structures as bases for rational action, the problem of characterizing rational desires has attracted little attention. AI relies heavily on goal conditions interpreted (apparently) as absolute expressions of desirability, but these cannot express varying degrees of goal satisfaction or preferences among alternative goals. Our previ...
متن کاملMID TERM RESULTS OF ARTHROSCOPIC RELEASE OF TENNIS ELBOW, PRELIMINARY REPORT IN IRAN
This was Presented in 5th International Congress of Iranian Iranian Society of Knee Surgery, Arthroscopy, and Sports Traumatology (ISKAST), 14-17 Feb 2018- Kish, Iran
متن کاملComputing Circumscription Revisited: Preliminary Report
We provide a general method which can be used in an algorithmic manner to reduce certain classes of 2nd-order circumscription axioms to logically equivalent 1st order formulas The algorithm takes as input an arbitrary 2nd-order formula and either returns as output an equivalent 1st order formula, or terminates wi th failure In addition to demonstrating the algor i thm by applying it to various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991